Effective preconditioning through minimum degree ordering interleaved with incomplete factorization
نویسندگان
چکیده
منابع مشابه
Effective Preconditioning through Ordering Interleaved with Incomplete Factorization
Consider the solution of a sparse linear system Ax = b when the matrix A is symmetric and positive definite. A typical iterative solver is obtained by using the method of Conjugate Gradients (CG) [15] preconditioned with an incomplete Cholesky (IC) factor L̂ [4]. The latter is an approximation to the (complete) Cholesky factor L, where A = LL . Consequently, the process of computing L̂ relies to ...
متن کاملOrdering Methods for Approximate Factorization Preconditioning
We investigate the ordering and ll-in strategies for approximate factorization preconditioning, focusing on automatic procedures to take care that a user friendly solver should converge equally fast whatever the original numbering of the unknowns. Considering the discrete PDE context, we pay particular attention to anisotropic problems for which factorizations without ll-in may behave poorly, w...
متن کاملAn Approximate Minimum Degree Ordering Algorithm
An Approximate Minimum Degree ordering algorithm (AMD) for preordering a symmetric sparse matrix prior to numerical factorization is presented. We use techniques based on the quotient graph for matrix factorization that allow us to obtain computationally cheap bounds for the minimum degree. We show that these bounds are often equal to the actual degree. The resulting algorithm is typically much...
متن کاملEffective and Robust Preconditioning of General SPD Matrices via Structured Incomplete Factorization
For general symmetric positive definite (SPD) matrices, we present a framework for designing effective and robust black-box preconditioners via structured incomplete factorization. In a scaling-and-compression strategy, off-diagonal blocks are first scaled on both sides (by the inverses of the factors of the corresponding diagonal blocks) and then compressed into low-rank approximations. ULV-ty...
متن کاملParallel Incomplete Factorization Preconditioning of Rotated Linear Fem Systems
The recent efforts in development of efficient solution methods for nonconforming finite element systems are inspired by their importance for various applications in scientific computations and engineering. This study is focused on the implementation of rotated bilinear elements. A locally modified approximation of the global stiffness matrix is proposed allowing for: a) a stable MIC(0) factori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2015
ISSN: 0377-0427
DOI: 10.1016/j.cam.2014.11.010